Billiards Optimization Algorithm: A New Game-Based Metaheuristic Approach

نویسندگان

چکیده

Metaheuristic algorithms are one of the most widely used stochastic approaches in solving optimization problems. In this paper, a new metaheuristic algorithm entitled Billiards Optimization Algorithm (BOA) is proposed and designed to be applications. The fundamental inspiration BOA design behavior players rules billiards game. Various steps described then its mathematical model thoroughly explained. efficiency dealing with problems evaluated through optimizing twenty-three standard benchmark functions different types including unimodal, high-dimensional multimodal, fixed-dimensional multimodal functions. order analyze quality results obtained by BOA, performance approach compared ten well-known algorithms. simulation show that high exploration exploitation abilities, achieves an impressive providing solutions objective superior far more competitive competitor

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fuzzy c-means bi-sonar-based Metaheuristic Optimization Algorithm

— Fuzzy clustering is an important problem which is the subject of active research in several real world applications. Fuzzy c-means (FCM) algorithm is one of the most popular fuzzy clustering techniques because it is efficient, straightforward, and easy to implement. Fuzzy clustering methods allow the objects to belong to several clusters simultaneously, with different degrees of membership. O...

متن کامل

Game Theory Based Coevolutionary Algorithm: A New Computational Coevolutionary Approach

Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zerosum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann’s theorem. Another central achievement of game theory i...

متن کامل

A New Stochastic Optimization Algorithm based on a Particle Collision Metaheuristic

In many complex optimization problems, the so-called stochastic optimization methods as genetic algorithms and simulated annealing have been applied successfully. However, these methods have drawbacks: simulated annealing is too sensitive to the choice of parameters and the canonical genetic algorithm is liable to suboptimal convergence. With the purpose of overcoming these drawbacks, a new sto...

متن کامل

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

متن کامل

A New Differential Evolution Based Metaheuristic for Discrete Optimization

This paper presents an approach to P systems verification using the Spin model checker. The authors have developed a tool which implements the proposed approach and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are specified using some patterns, representing hig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2023

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2023.034695